Genetic Althorithm (GA) foundation library. https://git.xagasoft.com/Smaller Projects/libgenetic.git/atom?h=main 2012-08-05T07:27:43+00:00 2012-08-05T07:27:43+00:00 Mike Buland mike@xagasoft.com 2012-08-05T07:27:43+00:00 urn:sha1:e9cfcc6dfc8427904ab227eea2452ccddd8f295c 2012-08-04T22:59:49+00:00 Mike Buland mike@xagasoft.com 2012-08-04T22:59:49+00:00 urn:sha1:aaa733d789612289396d69bb6cf3a0e5de1798a8 It should work the same, but it selects the number of bits to mutate first, then selects the individual bits instead of testing a random number on each bit. For very large phenotypes this will be significantly faster while producing about the same result. 2012-08-02T21:20:58+00:00 Mike Buland mike@xagasoft.com 2012-08-02T21:20:58+00:00 urn:sha1:3cdf68e08d438a0ced0f5f8d957a6aafd68cb43a 2012-07-18T07:26:34+00:00 Mike Buland mike@xagasoft.com 2012-07-18T07:26:34+00:00 urn:sha1:299640ce5f6499e07c5799f48897ac5a77e72c54 It uses the forever-blocking variation of the Bu::SynchroQueue dequeue to maximize efficiency. 2012-07-17T15:11:40+00:00 Mike Buland mike@xagasoft.com 2012-07-17T15:11:40+00:00 urn:sha1:a2679e3bc2f407fae6b97908aeebb215c6678ebc It restarts the threads every generation. Maybe not the worst thing every, but it seems like it would be better to stay in the thread and notify the main thread that they're done with that iteration. 2012-07-09T18:08:12+00:00 Mike Buland mike@xagasoft.com 2012-07-09T18:08:12+00:00 urn:sha1:d9dc8bda6278cc1f64b3656336d3f01472458303 2012-07-09T18:01:50+00:00 Mike Buland mike@xagasoft.com 2012-07-09T18:01:50+00:00 urn:sha1:1f7c135934b6604c5409d4b6f34861105c0a64cb 2012-07-09T14:39:37+00:00 Mike Buland mike@xagasoft.com 2012-07-09T14:39:37+00:00 urn:sha1:40ee7ad5aeadeb9823e1cd6e1218a1999c608a65